High Dimensional Data Clustering using Self-Organized Map
نویسندگان
چکیده
منابع مشابه
Document Clustering Using the 1 + 1 Dimensional Self-Organising Map
Automatic clustering of documents is a task that has become increasingly important with the explosion of online information. The SelfOrganising Map (SOM) has been used to cluster documents effectively, but efforts to date have used a single or a series of 2-dimensional maps. Ideally, the output of a document-clustering algorithm should be easy for a user to interpret. This paper describes a met...
متن کاملKohonen Self Organizing Map with Modified K-means clustering For High Dimensional Data Set
Since it was first proposed, it is amazing to notice how KMeans algorithm has survive over the years. It has been one among the well known algorithms for data clustering in the field of data mining. Day in and day out new algorithms are evolving for data clustering purposes but none can be as fast and accurate as the K-Means algorithm. But in spite of its huge speed, accuracy and simplicity K-M...
متن کاملClustering High Dimensional Data Using SVM
The Web contains massive amount of documents from across the globe to the point where it has become impossible to classify them manually. This project’s goal is to find a new method for clustering documents that are as close to humans’ classification as possible and at the same time to reduce the size of the documents. This project uses a combination of Latent Semantic Indexing (LSI) with Singu...
متن کاملHigh-dimensional data clustering
Clustering in high-dimensional spaces is a difficult problem which is recurrent in many domains, for example in image analysis. The difficulty is due to the fact that highdimensional data usually live in different low-dimensional subspaces hidden in the original space. This paper presents a family of Gaussian mixture models designed for highdimensional data which combine the ideas of subspace c...
متن کاملClustering high dimensional data using subspace and projected clustering algorithms
Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerates clusters of objects in all subspaces of a dataset. It tends to produce many over lapping clusters. Approach: Subspace clustering and projected clustering are research areas for clustering in high dimensional spaces. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Knowledge Engineering and Data Science
سال: 2019
ISSN: 2597-4637,2597-4602
DOI: 10.17977/um018v2i12019p31-40